Neighborhood Search Based Improved Bat Algorithm for Web Service Composition

Web services are provided as reusable software components in the services-oriented architecture. More complicated composite can be combined from these to satisfy user requirements represented a workflow with specified Quality of Service (QoS) limitations. The consists tasks where many considered for each task. Searching optimal combination and optimizing overall QoS limitations is Non-deterministic Polynomial (NP)-hard problem. This work focuses on Composition (WSC) problem proposes new service composition algorithm based micro-bats behavior while hunting prey. proposed determines web complex needs. It also addresses Bat Algorithm (BA) shortcomings, such tradeoff among exploration exploitation searching mechanisms, local optima, convergence rate. enhancement includes developed cooperative adaptive population initialization mechanism. An elitist mechanism utilized address BA between handled through neighborhood search Several benchmark datasets selected evaluate bat algorithm’s performance. simulation results estimated using average fitness value, standard deviation an execution time compared four bat-inspired algorithms. observed that introduced obtains significant results.